首页> 外文OA文献 >Optimal Cooperative Cognitive Relaying and Spectrum Access for an Energy Harvesting Cognitive Radio: Reinforcement Learning Approach
【2h】

Optimal Cooperative Cognitive Relaying and Spectrum Access for an Energy Harvesting Cognitive Radio: Reinforcement Learning Approach

机译:能量最优协作认知中继与频谱接入   收获认知无线电:强化学习方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, we consider a cognitive setting under the context ofcooperative communications, where the cognitive radio (CR) user is assumed tobe a self-organized relay for the network. The CR user and the PU are assumedto be energy harvesters. The CR user cooperatively relays some of theundelivered packets of the primary user (PU). Specifically, the CR user storesa fraction of the undelivered primary packets in a relaying queue (buffer). Itmanages the flow of the undelivered primary packets to its relaying queue usingthe appropriate actions over time slots. Moreover, it has the decision ofchoosing the used queue for channel accessing at idle time slots (slots wherethe PU's queue is empty). It is assumed that one data packet transmissiondissipates one energy packet. The optimal policy changes according to theprimary and CR users arrival rates to the data and energy queues as well as thechannels connectivity. The CR user saves energy for the PU by taking theresponsibility of relaying the undelivered primary packets. It optimallyorganizes its own energy packets to maximize its payoff as time progresses.
机译:在本文中,我们考虑了在协作通信环境下的认知环境,其中认知无线电(CR)用户被假定为网络的自组织中继。假定CR用户和PU是能量收集器。 CR用户合作中继主要用户(PU)的一些未传递的数据包。具体而言,CR用户将未传递的主要数据包的一部分存储在中继队列(缓冲区)中。它使用时隙上的适当操作来管理未传递的主数据包到其中继队列的流。此外,它具有在空闲时隙(PU队列为空的时隙)中选择用于信道访问的已用队列的决定。假设一个数据包传输消耗一个能量包。最优策略根据主要用户和CR用户到达数据和能源队列的速率以及通道连接性而变化。 CR用户负责中继未传递的主数据包,从而为PU节省了能量。随着时间的流逝,它可以最佳地组织自己的能量包,以最大化其收益。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号